package stack;/*

 */

import com.sun.org.apache.bcel.internal.generic.RET;

/**
 * @ClassName ArrayStacjk
 * @Author Final
 * @Project DataStructures
 */
public class ArrayStack {

    private int maxSize;//栈的大小
    private int[] stack;//用数组模拟栈，存放数据
    private  int top=-1; //栈顶。初始值为-1

    //构造器
    public ArrayStack(int maxSize){
        this.maxSize=maxSize;
        stack=new int[this.maxSize];
    }

    //判满
    public boolean isFull(){
        return top==maxSize-1;
    }

    //判空
    public boolean isEmpty(){
        return top==-1;
    }

    public void push(int value){
        if (isFull()){
            System.out.println("栈满");
            return;
        }
        top++;
        stack[top]=value;
    }

    public int pop(){
        if (isEmpty()){
            throw new RuntimeException("栈空，没有数据");
        }
        int value =stack[top];
        top--;
        return value;
    }

    public void list(){
        if (isEmpty()){
            System.out.println("没有数据，栈空");
            return;
        }
        for (int i=top;i>=0;i--){
            System.out.printf("stack[%d]=%d\n",i,stack[i]);
        }
    }
}
